منابع مشابه
Recursive generation of IPR fullerenes
We describe a new construction algorithm for the recursive generation of all non-isomorphic IPR fullerenes. Unlike previous algorithms, the new algorithm stays entirely within the class of IPR fullerenes, that is: every IPR fullerene is constructed by expanding a smaller IPR fullerene unless it belongs to a limited class of irreducible IPR fullerenes that can easily be made separately. The clas...
متن کاملPI, Szeged and Revised Szeged Indices of IPR Fullerenes
In this paper PI, Szeged and revised Szeged indices of an infinite family of IPR fullerenes with exactly 60+12n carbon atoms are computed. A GAP program is also presented that is useful for our calculations.
متن کاملThe Generation of Fullerenes
We describe an efficient new algorithm for the generation of fullerenes. Our implementation of this algorithm is more than 3.5 times faster than the previously fastest generator for fullerenes - fullgen - and the first program since fullgen to be useful for more than 100 vertices. We also note a programming error in fullgen that caused problems for 136 or more vertices. We tabulate the numbers ...
متن کاملpi, szeged and revised szeged indices of ipr fullerenes
in this paper pi, szeged and revised szeged indices of an infinite family of ipr fullereneswith exactly 60+12n carbon atoms are computed. a gap program is also presented that isuseful for our calculations.
متن کاملGeneration of Fullerenes by Circumscribing
für Naturforschung in cooperation with the Max Planck Society for the Advancement of Science under a Creative Commons Attribution 4.0 International License. Dieses Werk wurde im Jahr 2013 vom Verlag Zeitschrift für Naturforschung in Zusammenarbeit mit der Max-Planck-Gesellschaft zur Förderung der Wissenschaften e.V. digitalisiert und unter folgender Lizenz veröffentlicht: Creative Commons Namen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Chemistry
سال: 2015
ISSN: 0259-9791,1572-8897
DOI: 10.1007/s10910-015-0513-7